AnchorHash: A Scalable Consistent Hash
نویسندگان
چکیده
Consistent hashing is a central building block in many networking applications, such as maintaining connection affinity of TCP flows. However, current consistent solutions do not ensure full consistency under arbitrary changes or scale poorly terms memory footprint, update time and key lookup complexity. We present AnchorHash, scalable fully-consistent algorithm. AnchorHash achieves high rate, low footprint time. formally establish its strong theoretical guarantees, an advanced implementation with only few bytes per resource. Moreover, evaluations indicate that scales on single core to 100 million resources while still achieving rate more than 15 keys second.
منابع مشابه
A Fast, Minimal Memory, Consistent Hash Algorithm
We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation...
متن کاملResizable, Scalable, Concurrent Hash Tables
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers. We implemented our algorithms in the Linux kernel, to test ...
متن کاملDesign of a Scalable Hash Table on a GPU
We investigate the scalability of an existing lockless hash table when it is implemented on a GPU. This lockless hash table is an essential part of a model checker, a tool that can be used to prove the correctness of software that performs critical tasks. We show that our implementation of the hash table on a GPU is scalable and that a GPU can lookup twice as much per second as a CPU when runni...
متن کاملScalable Hash-Based Estimation of Divergence Measures
We propose a scalable divergence estimation method based on hashing. Consider two continuous random variables X and Y whose densities have bounded support. We consider a particular locality sensitive random hashing, and consider the ratio of samples in each hash bin having non-zero numbers of Y samples. We prove that the weighted average of these ratios over all of the hash bins converges to fd...
متن کاملA Scalable Hash-Based Mobile Agent Location Mechanism
In this paper, we propose a novel mobile agent tracking mechanism based on hashing. To allow our system to adapt to variable workloads, dynamic rehashing is supported. The proposed mechanism scales well with both the number of agents and the number of moving and querying operations. We also report on its implementation in the Aglets platform and present performance results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE ACM Transactions on Networking
سال: 2021
ISSN: ['1063-6692', '1558-2566']
DOI: https://doi.org/10.1109/tnet.2020.3039547